Peer Offloading in Mobile-Edge Computing With Worst Case Response Time Guarantees
نویسندگان
چکیده
Mobile edge computing (MEC) is a new paradigm that provides cloud services at the of networks. To achieve better performance with limited resources, peer offloading between cooperative servers (e.g. MEC- enabled base stations) has been proposed as an effective technique to handle bursty and spatially imbalanced arrival computation tasks. While various metrics policies have considered in literatures, worst-case response time, common Quality Service(QoS) requirement real-time applications, yet receives much less attention. fill gap, we formulate problem based on stochastic model propose two online algorithms for cases without prior knowledge task rate. Our goal maximize utility function time-average throughput under constraints energy consumption time. Both theoretical analysis numerical results show our are able produce close optimal performance.
منابع مشابه
Computation Peer Offloading for Energy-Constrained Mobile Edge Computing in Small-Cell Networks
The (ultra-)dense deployment of small-cell base stations (SBSs) endowed with cloud-like computing functionalities paves the way for pervasive mobile edge computing (MEC), enabling ultra-low latency and location-awareness for a variety of emerging mobile applications and the Internet of Things. To handle spatially uneven computation workloads in the network, cooperation among SBSs via workload p...
متن کاملUAV-Enabled Mobile Edge Computing: Offloading Optimization and Trajectory Design
With the emergence of diverse mobile applications (such as augmented reality), the quality of experience of mobile users is greatly limited by their computation capacity and finite battery lifetime. Mobile edge computing (MEC) and wireless power transfer are promising to address this issue. However, these two techniques are susceptible to propagation delay and loss. Motivated by the chance of s...
متن کاملCoalition Structure Generation with Worst Case Guarantees
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, nding the optimal coalition structure is NP-complete. But then, can the coalition structure found via a partial search be guara...
متن کاملOnline checkpointing with improved worst-case guarantees
In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to replace an old checkpoint by the current state. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T when requested to rewind to some time t...
متن کاملEnhanced Mobile Computing Experience with Cloud Offloading
The need for increased performance of mobile device directly conflicts with the desire for longer battery life. Offloading computation to multiple devices is an effective method to reduce energy consumption and enhance performance for mobile applications. Android provides mechanisms for creating mobile applications but lacks a native scheduling system for determining where code should be execut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Internet of Things Journal
سال: 2021
ISSN: ['2372-2541', '2327-4662']
DOI: https://doi.org/10.1109/jiot.2020.3019492